Level number sequences for trees
نویسندگان
چکیده
منابع مشابه
Level number sequences for trees
This paper concerns some statistical properties of a parameter related to the profiles of binary trees. Define the level of a node v in a rooted tree t as the number of nodes on the branch connecting v to the root of t (counting both end nodes). The level number sequence of a tree t is the infinite sequence of integers (nl, n2, • • .) such that nj is the number of nodes at level j in tree t. Wi...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملRadio number for trees
Let G be a connected graph with diameter diam(G). The radio number for G, denoted by rn(G), is the smallest integer k such that there exists a function f : V (G) → {0, 1, 2, · · · , k} with the following satisfied for all vertices u and v: |f(u)−f(v)| ≥ diam(G)−dG(u, v)+1, where dG(u, v) is the distancee between u and v. We prove a lower bound for the radio number of trees, and characterize the...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90137-3